Numerical strategies for variational updates in large strain inelasticity with incompressibility constraint
نویسندگان
چکیده
In finite deformation inelasticity, one often has to deal with the incompressibility constraint. past, this was dealt using, for example, an exponential mapping approach, which yields exact volume preservation in plastic deformations. article however, special-linear update approach by Hurtado et al. The update: An application of differential manifold theory isochoric plasticity flow rules, Int J Numer Methods Eng. 2014;97(4):298-312, utilizes a projection method fulfill constraint is used. model applied isotropic novel approximation logarithm and treats kinematic hardening without losing symmetry internal variables. results are compared models utilizing numerical experiments.
منابع مشابه
Variational Constitutive Updates for Strain Gradient Isotropic Plasticity
In the past decades, various strain gradient isotropic plasticity theories have been developed to describe the size-dependence plastic deformation mechanisms observed experimentally in micron-indentation, torsion, bending and thin-film bulge tests in metallic materials. Strain gradient plasticity theories also constitute a convenient device to introduce ellipticity in the differential equations...
متن کاملVARIATIONAL DISCRETIZATION AND MIXED METHODS FOR SEMILINEAR PARABOLIC OPTIMAL CONTROL PROBLEMS WITH INTEGRAL CONSTRAINT
The aim of this work is to investigate the variational discretization and mixed finite element methods for optimal control problem governed by semi linear parabolic equations with integral constraint. The state and co-state are approximated by the lowest order Raviart-Thomas mixed finite element spaces and the control is not discreted. Optimal error estimates in L2 are established for the state...
متن کاملLarge Alphabets and Incompressibility
We briefly survey some concepts related to empirical entropy — normal numbers, de Bruijn sequences and Markov processes — and investigate how well it approximates Kolmogorov complexity. Our results suggest lth-order empirical entropy stops being a reasonable complexity metric for almost all strings of length m over alphabets of size n about when nl surpasses m.
متن کاملA numerical approach to variational problems subject to convexity constraint
We describe an algorithm to approximate the minimizer of an elliptic functional in the form ∫ Ω j(x, u,∇u) on the setC of convex functions u in an appropriate functional spaceX . Such problems arise for instance in mathematical economics [4]. A special case gives the convex envelope u∗∗ 0 of a given function u0. Let (Tn) be any quasiuniform sequence of meshes whose diameter goes to zero, and In...
متن کاملBranch-and-Prune Search Strategies for Numerical Constraint Solving
Xuan-Ha VU, Marius-Călin SILAGHI, Djamila SAM-HAROUD and Boi FALTINGS 1 Cork Constraint Computation Centre, University College Cork (UCC), 14 Washington Street West, Cork, Ireland, Email: [email protected]; 2 Department of Computer Science, Florida Institute of Technology (FIT), 150 West University Boulevard, Melbourne, FL-32901-6975, USA Email: [email protected]; 3 Artificial Intelligenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Numerical Methods in Engineering
سال: 2021
ISSN: ['0029-5981', '1097-0207']
DOI: https://doi.org/10.1002/nme.6855